Reconfiguration of Cube-Style Modular Robots Using O(logn) Parallel Moves
نویسندگان
چکیده
We consider a model of reconfigurable robot, introduced and prototyped by the robotics community. The robot consists of independently manipulable unit-square atoms that can extend/contract arms on each side and attach/detach from neighbors. The optimal worst-case number of sequential moves required to transform one connected configuration to another was shown to be Θ(n) at ISAAC 2007. However, in principle, atoms can all move simultaneously. We develop a parallel algorithm for reconfiguration that runs in only O(logn) parallel steps, although the total number of operations increases slightly to Θ(n logn). The result is the first (theoretically) almost-instantaneous universally reconfigurable robot built from simple units.
منابع مشابه
Linear Reconfiguration of Cube-Style Modular Robots
In this paper we propose a novel algorithm that, given a source robot S and a target robot T , reconfigures S into T . Both S and T are robots composed of n atoms arranged in 2 × 2 × 2 metamodules. The reconfiguration involves a total of O(n) atom operations (expand, contract, attach, detach) and is performed in O(n) parallel steps. This improves on previous reconfiguration algorithms [1–3], wh...
متن کاملDistributed reconfiguration of 2D lattice-based modular robotic systems
We prove universal reconfiguration (i.e., reconfiguration between any two robotic systems with the same number of modules) of 2-dimensional lattice-based modular robots by means of a distributed algorithm. To the best of our knowledge, this is the first known reconfiguration algorithm that applies in a general setting to a wide variety of particular modular robotic systems, and holds for both s...
متن کاملA Complete, Local and Parallel Reconfiguration Algorithm for Cube Style Modular Robots
We present a complete, local, and parallel reconfiguration algorithm for metamorphic robots made up of Telecubes, six degree of freedom cube shaped modules currently being developed at PARC. We show that by using 2x2x2 meta-modules we can achieve completeness of reconfiguration space using only local rules. Furthermore, this reconfiguration can be done in place and massively in parallel with ma...
متن کاملEfficient constant-velocity reconfiguration of crystalline robots
In this paper we propose novel algorithms for reconfiguring modular robots that are composed of n atoms. Each atom has the shape of a unit cube and can expand/contract each face by half a unit, as well as attach to or detach from faces of neighboring atoms. For universal reconfiguration, atoms must be arranged in 2×2×2 modules. We respect certain physical constraints: each atom reaches at most ...
متن کاملSolutions for 3-D Self-reconfiguration in a Modular Robotic System: Implementation and Motion Planning
In this manuscript, we discuss new solutions for mechanical design and motion planning for a class of three-dimensional modular self-reconfigurable robotic system, namely I-Cubes. This system is a bipartite collection of active links that provide motions for self-reconfiguration, and cubes acting as connection points. The links are three degree of freedom manipulators that can attach to and det...
متن کامل